Hash functions using chaotic iterations
نویسندگان
چکیده
In this paper, a novel formulation of discrete chaotic iterations in the field of dynamical systems is given. Their topological properties are studied: it is mathematically proved that, under some conditions, these iterations have a chaotic behavior in the meaning of Devaney. This chaotic behavior allows us to propose a way to generate new hash functions. An illustration example is detailed in order to show how to use our theoretical study in practice.
منابع مشابه
A topological chaos framework for hash functions
This paper presents a new procedure of generating hash functions which can be evaluated using some mathematical tools. This procedure is based on discrete chaotic iterations. First, it is mathematically proven, that these discrete chaotic iterations can be considered as a particular case of topological chaos. Then, the process of generating hash function based on the topological chaos is detail...
متن کاملDesign and evaluation of chaotic iterations based keyed hash function
Investigating how to construct a secure hash algorithm needs in-depth study, as various existing hash functions like the MD5 algorithm have recently exposed their security flaws. At the same time, hash function based on chaotic theory has become an emerging research in the field of nonlinear information security. As an extension of our previous research works, a new chaotic iterations keyed has...
متن کاملA Topological Study of Chaotic Iterations Application to Hash Functions
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its topological behavior is proposed. It is stated that, in addition to being chaotic as defined in the Devaney’s formulation, this tool possesses the property of top...
متن کاملRandomness and disorder of chaotic iterations. Applications in information security field
Design and cryptanalysis of chaotic encryption schemes are major concerns to provide secured information systems. Pursuing our previous research works, some well-defined discrete chaotic iterations that satisfy the reputed Devaney’s definition of chaos have been proposed. In this article, we summarize these contributions and propose applications in the fields of pseudorandom number generation, ...
متن کاملIntroducing the truly chaotic finite state machines and their applications in security field
The truly chaotic finite machines introduced by authors in previous research papers are presented here. A state of the art in this discipline, encompassing all previous mathematical investigations, is provided, explaining how finite state machines can behave chaotically regarding the slight alteration of their inputs. This behavior is explained using Turing machines and formalized thanks to a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.02489 شماره
صفحات -
تاریخ انتشار 2017